Disassembling Graph Method with Matrix Boolean Multiplication ⊙ 利用矩阵布尔乘⊙的图形拆分方法
Algorithm analysis reveals that, the heuristic algorithm presented in this paper is better than other two algorithms ( Boolean Matrix Multiplication and repeated calling Breadth First Search Algorithm) during neighborhood searching of TS. 算法复杂度分析的结果显示,在TS进行临域搜索时本文提出的启发式算法优于布尔矩阵乘法以及重复调用广度优先算法。